Paper Number
نویسندگان
چکیده
Trail-Braking (TB) is a common cornering technique used in rally racing to negotiate tight corners at high speeds. It has been shown that TB can be generated as the solution to the minimum time cornering problem, subject to fixed final positioning of the vehicle after the corner, using non-linear programming (NLP). In this work we formulate the optimization problem relaxing the final positioning of the vehicle with respect to the width of the road in order to study the optimality of late-apex trajectories typically followed by rally drivers. Non-linear programming optimization is applied on a variety of corners. The optimal control inputs are approximated by simple piecewise linear input profiles defined by a small number of parameters. It is shown that the proposed input parameterization can generate close to optimal TB along the various corner geometries.
منابع مشابه
A new model for Assessment and Optimization of Number of Spare Transformers and their Locations in Distribution Systems
In this paper, a new model has been presented to determine the number of spare transformers and their locations for distribution stations. The number of spare transformers must be so that they need minimum investment. Furthermore, they must be sufficient for replacing with transformers that have been damaged. For this reason, in this paper a new purpose function has been presented to maximize p...
متن کاملارزیابی کارایی نسبی بیمارستانهای دولتی استان یزد با استفاده از مدل تحلیل پوششی دادهها
Introduction: Performance measurement, programming and goal setting for performance improvement are needed for organizations to improve their performance. Despite advancement in performance measurement systems, many organizations still emphasize on old models. Methods: This paper analyzes the efficiency of Yazd governmental hospitals by using DEA model from 2004 to 2006. The inputs in DEA...
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملInvestigation of the Local Nusselt Number of the Symmetrical Liquid-Liquid Jets Emitting from a Nozzle
The aim of this paper is to study the local Nusselt number of the symmetrical liquid-liquid jets emitting from a nozzle. Equations obtained from theoretical works are arranged in the form of a computerized model. The validity of this model was tested by the data from an experimental paper [1]. After few adjustments the model predicted the experimental data with a reasonable accuracy. Making...
متن کاملThe unit sum number of discrete modules
In this paper, we show that every element of a discrete module is a sum of two units if and only if its endomorphism ring has no factor ring isomorphic to $Z_{2}$. We also characterize unit sum number equal to two for the endomorphism ring of quasi-discrete modules with finite exchange property.
متن کاملThe Italian domatic number of a digraph
An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...
متن کامل